Manipulability of consular election rules
نویسندگان
چکیده
The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optimist nor a pessimist, it must have a weak dictator. However, the assumption that the function is onto with respect to singletons makes the Duggan-Schwartz theorem inapplicable to elections which necessarily select a committee with multiple members. In this paper we make a start on this problem by considering elections which elect a committee of size two (such as the consulship of ancient Rome). We establish that if such a consular election rule cannot be expressed as the union of two disjoint social choice functions, then strategy-proofness implies the existence of a dictator. Although we suspect that a similar result holds for larger sized committees, there appear to be many obstacles to proving it, which we
منابع مشابه
An Empirical Study of the Manipulability of Single Transferable Voting
Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only boun...
متن کاملManipulability of Single Transferable Vote
For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically the cost of manipulating the single transferable vote (STV) rule. This was one of the first rules shown to be NP-hard to manipulate. It also appears to be on...
متن کاملAsymptotic collusion-proofness of voting rules: the case of large number of candidates
We study manipulability in elections when the number of candidates is large. Elections with a large number of voters have been studied in the literature and the focus of this paper is on studying election with a large number of candidates. Manipulability, when the number of candidates is large, is significant in the context of computational social choice. Our investigation in this paper covers ...
متن کاملComputing the Degree of Manipulability in the Case of Multiple Choice
The problem of the manipulability of known social choice rules in the case of multiple choice is considered. Several concepts of expanded preferences (preferences over the sets of alternatives) are elaborated. As a result of this analysis ordinal and nonordinal methods of preferences expanding are defined. The notions of the degree of manipulability are extended to the case under study. Using t...
متن کاملAnonymous voting and minimal manipulability
We compare the manipulability of different choice rules by considering the number of manipulable profiles. We establish the minimal number of such profiles for tops-only, anonymous, and surjective choice rules, and show that this number is attained by unanimity rules with status quo.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.07102 شماره
صفحات -
تاریخ انتشار 2016